A Construction of Cospectral Graphs for the Normalized Laplacian

نویسندگان

  • Steve Butler
  • Jason Grout
چکیده

We give a method to construct cospectral graphs for the normalized Laplacian by a local modification in some graphs with special structure. Namely, under some simple assumptions, we can replace a small bipartite graph with a cospectral mate without changing the spectrum of the entire graph. We also consider a related result for swapping out biregular bipartite graphs for the matrix A + tD. We produce (exponentially) large families of non-bipartite, non-regular graphs which are mutually cospectral, and also give an example of a graph which is cospectral with its complement but is not self-complementary.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Cospectral graphs for the normalized Laplacian by “toggling”

A characteristic of the normalized Laplacian matrix is the possibility for cospectral graphs which do not have the same number of edges. We give a construction of an infinite family of weighted graphs that are pairwise cospectral and which can be transformed into simple graphs. In particular, some of these graphs are cospectral with subgraphs of themselves. In the proof we deconstruct these gra...

متن کامل

A cospectral family of graphs for the normalized Laplacian found by toggling

We give a construction of a family of (weighted) graphs that are pairwise cospectral with respect to the normalized Laplacian matrix, or equivalently probability transition matrix. This construction can be used to form pairs of cospectral graphs with differing number of edges, including situations where one graph is a subgraph of the other. The method used to demonstrate cospectrality is by sho...

متن کامل

Constructing cospectral graphs for the normalized Laplacian

We give a method to construct cospectral graphs for the normalized Laplacian by swapping edges between vertices in some special graphs. We also give a method to construct an arbitrarily large family of (non-bipartite) graphs which are mutually cospectral for the normalized Laplacian matrix of a graph. AMS 2010 subject classification: 05C50

متن کامل

Cospectral Bipartite Graphs for the Normalized Laplacian Table of Contents

We construct two infinite families of trees that are pairwise cospectral with respect to the normalized Laplacian. We also use the normalized Laplacian applied to weighed graphs to give new constructions of cospectral pairs of bipartite unweighted graphs.

متن کامل

Using twins and scaling to construct cospectral graphs for the normalized Laplacian

The spectrum of the normalized Laplacian matrix cannot determine the number of edges in a graph, however finding constructions of cospectral graphs with differing number of edges has been elusive. In this paper we use basic properties of twins and scaling to show how to construct such graphs. We also give examples of families of graphs which are cospectral with a subgraph for the normalized Lap...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • Electr. J. Comb.

دوره 18  شماره 

صفحات  -

تاریخ انتشار 2011